Selective Compression Technique using Variable-to-Fixed and Fixed-to-Variable Codes
نویسندگان
چکیده
منابع مشابه
Selective Compression Techniques using Variable-to-Fixed and Fixed-to-Variable Codes
Ìn this paper, we propose two code based techniques: Variable-to-Fixed codes and Fixed-to-Variable codes for power efficient test data compression. The proposed scheme with the aim of achieving high compression ratio and low power consumption relies on reducing, the number of bits for representing the original test vector and the number of transitions per second. Simulation results on ISCAS‟89 ...
متن کاملVariable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).
متن کاملVariable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
It is proved that for finite-alphabet, finite-state unifilar sources, variable-to-fixed length codes provide better large deviations performance of the empirical compression ratio, than fixed-to-variable Manuscript received March 21, 1990; revised March 6, 1991. N. Merhav was with AT&T Bell Laboratories, Murray Hill, NJ. He is now with the Department of Electrical Engineering, Technion-Israel I...
متن کاملA Comparative Complexity Study of Fixed-to-variable Length and Variable-to-fixed Length Source Codes
In this paper we present an analysis of the storage complexity of Huffman codes, Tunstall codes and arithmetic codes in various implementations and relate this to the achieved redundancies. It turns out that there exist efficient implementations of both Huffman and Tunstall codes and that their approximations result in arithmetic codes. Although not optimal, the arithmetic codes still have a be...
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15692-4570